Using quadratic simplicial elements for hierarchical approximation and visualization
نویسندگان
چکیده
Best quadratic simplicial spline approximations can be computed, using quadratic Bernstein-Bézier basis functions, by identifying and bisecting simplicial elements with largest errors. Our method begins with an initial triangulation of the domain; a best quadratic spline approximation is computed; errors are computed for all simplices; and simplices of maximal error are subdivided. This process is repeated until a user-specified global error tolerance is met. The initial approximations for the unit square and cube are given by two quadratic triangles and five quadratic tetrahedra, respectively. Our more complex triangulation and approximation method that respects field discontinuities and geometrical features allows us to better approximate data. Data is visualized by using the hierarchy of increasingly better quadratic approximations generated by this process. Many visualization problems arise for quadratic elements. First tessellating quadratic elements with smaller linear ones and then rendering the smaller linear elements is one way to visualize quadratic elements. Our results show a significant reduction in the number of simplices required to approximate data sets when using quadratic elements as compared to using linear elements.
منابع مشابه
On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over twoor three-dimensional domains typically contain boundaries and discontinuities that are to be preserved and approximated well for data analysis and visualization. Curved simplicial elements make possible a better representation of curved geo...
متن کاملBest Quadratic Spline Approximation
We present a method for hierarchical data approximation using quadratic simplicial elements for domain decomposition and field approximation. Higher-order simplicial elements can approximate data better than linear elements. Thus, fewer quadratic elements are required to achieve similar approximation quality. We use quadratic basis functions and compute best quadratic simplicial spline approxim...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملUncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space
Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...
متن کاملQUADRATIC STARK CONSTANTS OF NEUTRAL COPPER SPECTRAL LINES IN THE COULOMB APPROXIMATION
Quadratic Stark constants of neutral copper spectral lines for all s,p, and d levels are calculated using the Coulomb approximation. These results are compared with existing data and, generally, good agreement is observed
متن کامل